package com.leetcode.LC;

public class LC1037 {
    public boolean isBoomerang(int[][] points) {

        //利用前两个点算出直线方程，带入最后一个点看是否符合
        //三点构成的三角形面积是否为0
        //任选两点的斜率是否相同
        int x1 = points[0][0] - points[1][0];
        int y1 = points[0][1] - points[1][1];

        int x2 = points[0][0] - points[2][0];
        int y2 = points[0][1] - points[2][1];

        return x1 * y2 != x2 * y1;

    }

}
